An Implementation of Higher-order Functors
نویسنده
چکیده
Recently the module language of SML of New Jersey has been augmented with higher-order functors. Their semantics is described in Tof94, MT94]. This paper sketches how higher-order functors can be implemented with eecient static representations. The key idea of the SML/NJ implementation is the sharing of signature environments , and this idea has been carried over to the higher-order case.
منابع مشابه
Engineering Higher-Order Modules in SML/NJ
SML/NJ and other Standard ML variants extend the ML module system with higher-order functors, elevating the module language to a full functional language. In this paper, we describe the implementation of the higher-order module system in SML/NJ, which is unique in providing “true” higher-order behavior at the static level. This second generation implementation of higher-order modules in SML/NJ ...
متن کاملEfficient Implementation of Automaton Functors for the Verification of Graph Transformation Systems
In this paper we show new applications for recognizable graph languages to invariant checking. Furthermore we present details about techniques we used for an implementation of a tool suite for (finite) automaton functors which generalize finite automata to the setting of recognizable (graph) languages. In order to develop an efficient implementation we take advantage of Binary Decision Diagrams...
متن کاملA Higher-order Module Discipline with Separate Compilation, Dynamic Linking, and Pickling
We present a higher-order module discipline with separate compilation and concurrent dynamic linking. Based on first-order modules one can program security policies for systems that link modules from untrusted locations (e.g., Java). We introduce a pickling operation that writes persistent clones of volatile, possibly higher-order data structures on the file system. Our pickling operation respe...
متن کاملA Semantics for Higher-Order Functors
Standard ML has a module system that allows one to deene para-metric modules, called functors. Functors are \\rst-order," meaning that func-tors themselves cannot be passed as parameters or returned as results of functor applications. This paper presents a semantics for a higher-order module system which generalizes the module system of Standard ML. The higher-order functors described here are ...
متن کاملMei – A Module System for Mechanized
This thesis presents several module systems, in particular Mei and DMei, designed for mechanized mathematics systems. Mei is a λ-calculus style module system that supports higher-order functors in a natural way. The semantics of functor application is based on substitution. A novel coercion mechanism integrates a parameter passing mechanism based on theory interpretations with simple λ-calculus...
متن کامل